High-Performance Delaunay Triangulation for Many-Core Computers
نویسندگان
چکیده
We present an efficient implementation of a Dwyer-style Delaunay triangulation algorithm that runs in O(N) expected time. An implicit quad-tree is constructed directly from the floating point bit patterns of the input points by sorting the corresponding Morton codes with a radix sorting procedure. This unique structure adapts elegantly to any (non-)uniform distribution of input points and increases the accuracy of the merging calculations by grouping floating point values with similar bit patterns. Our implementation allows for easy parallelization and we demonstrate a record construction speed of one Billion Delaunay triangles in just 8s on a many-core SMP machine.
منابع مشابه
Capacity-Constrained Delaunay Triangulation for point distributions
Sample point distributions possessing blue noise spectral characteristics play a central role in computer graphics, but are notoriously difficult to generate. We describe an algorithm to very efficiently generate these distributions. The core idea behind our method is to compute a Capacity-Constrained Delaunay Triangulation (CCDT), namely, given a simple polygon P in the plane, and the desired ...
متن کاملAn improved incremental algorithm for constructing restricted delaunay triangulations
This work presents an algorithm that given a generalized planar graph obtains its constrained Delaunay triangulation (CDT). The proposed method, which follows the general approach of [3], works incrementally based on two improved procedures. The first improvement gives a procedure that inserts a new point in a CDT; the second one is an algorithm that enforces a new constraining edge in a CDT. I...
متن کاملFast Parallel Triangulation Algorithm of Large Data Sets in E2 and E3 for In-Core and Out-Core Memory Processing
A triangulation of points in , or a tetrahedronization of points in , is used in many applications. It is not necessary to fulfill the Delaunay criteria in all cases. For large data (more then 5 ∙ 10 points), parallel methods are used for the purpose of decreasing time complexity. A new approach for fast and effective parallel CPU and GPU triangulation, or tetrahedronization, of large data sets...
متن کاملAlgorithms for Manipulation with Large Geometric and Graphic Data
The theme of this work is manipulating large data in the field of computer graphics. Generally, large data appear in many scientific disciplines ranging from weather forecasting to marketing analyses. The computing power of modern computers still increases but so do the demands to process larger and larger data sets. The main memory is in principle insufficient to hold all the data at the same ...
متن کاملHigh Performance Parallel Mesh Generation and Adaption
The continuing growth of complexity in physical models and the addition of more accurate geometrical features intensifies the weight placed on mesh generation. Driven by the increase of computational speed and the availability of multi-core CPUs current programming paradigms are not sufficient anymore to fully utilize the available computational power. A high performance mesh generation approac...
متن کامل